Consideration of Partial User Preferences in Evolutionary Multiobjective Optimization
نویسنده
چکیده
Evolutionary multiobjective optimization usually attempts to find a good approximation to the complete Pareto optimal front. However, often the user has at least a vague idea about what kind of solutions might be preferred. If such information is available, it can be used to focus the search, yielding a more fine-grained approximation of the most relevant (from a user’s perspective) areas of the Pareto optimal front and/or reducing computation time. This chapter surveys the literature on incorporating partial user preference information in evolutionary multiobjective optimization.
منابع مشابه
SPAM: Set Preference Algorithm for Multiobjective Optimization
This paper pursues the idea of a general multiobjective optimizer that can be flexibly adapted to arbitrary user preferences— assuming that the goal is to approximate the Pareto-optimal set. It proposes the Set Preference Algorithm for Multiobjective Optimization (SPAM) the working principle of which is based on two observations: (i) current multiobjective evolutionary algorithms (MOEAs) can be...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملFocusing Search in Multiobjective Evolutionary Optimization through Preference Learning from User Feedback
The problem of computing the set of Pareto-optimal solutions in multiobjective optimization has been tackled by means of different approaches in previous years, including evolutionary algorithms. A key advantage of computing the whole set of Pareto-optimal solutions is completeness: None of the solutions that might be maximally preferred by the user is lost. An obvious disadvantage, however, is...
متن کاملInteractive evolutionary multiobjective optimization driven by robust ordinal regression
This paper presents the Necessary-preference-enhanced Evolutionary Multiobjective Optimizer (NEMO), which combines an evolutionary multiobjective optimization with robust ordinal regression within an interactive procedure. In the course of NEMO, the decision maker is asked to express preferences by simply comparing some pairs of solutions in the current population. The whole set of additive val...
متن کاملPreferences and their application in evolutionary multiobjective optimization
The paper describes a new preference method and its use in multiobjective optimisation. These preferences are developed with a goal to reduce the cognitive overload associated with the relative importance of a certain criterion within a multiobjective design environment involving large numbers of objectives. Their successful integration with several genetic algorithm–based design search and opt...
متن کامل